0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E %s %d THM 0.13/0.33 % Computer : n024.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 1440 0.13/0.33 % WCLimit : 180 0.13/0.33 % DateTime : Thu Jul 4 05:51:24 EDT 2024 0.13/0.34 % CPUTime : 0.21/0.48 Running higher-order theorem proving 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.6sEbAUIO3E/E---3.1_28763.p 0.21/0.50 # Version: 3.2.0-ho 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.50 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting post_as_ho12 with 180s (1) cores 0.21/0.50 # Starting new_bool_9 with 180s (1) cores 0.21/0.50 # Starting post_as_ho1 with 180s (1) cores 0.21/0.50 # Starting post_as_ho4 with 180s (1) cores 0.21/0.50 # Starting post_as_ho2 with 180s (1) cores 0.21/0.50 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.21/0.50 # Starting full_lambda_10 with 180s (1) cores 0.21/0.50 # Starting new_ho_8 with 180s (1) cores 0.21/0.50 # new_bool_9 with pid 28845 completed with status 0 0.21/0.50 # Result found by new_bool_9 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.50 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting post_as_ho12 with 180s (1) cores 0.21/0.50 # Starting new_bool_9 with 180s (1) cores 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0) 0.21/0.50 # Search class: HGUNF-FFSS32-MSSFFSBN 0.21/0.50 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.50 # Starting post_as_ho12 with 98s (1) cores 0.21/0.50 # post_as_ho12 with pid 28853 completed with status 0 0.21/0.50 # Result found by post_as_ho12 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA. 0.21/0.50 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting post_as_ho12 with 180s (1) cores 0.21/0.50 # Starting new_bool_9 with 180s (1) cores 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0) 0.21/0.50 # Search class: HGUNF-FFSS32-MSSFFSBN 0.21/0.50 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.50 # Starting post_as_ho12 with 98s (1) cores 0.21/0.50 # Preprocessing time : 0.001 s 0.21/0.50 # Presaturation interreduction done 0.21/0.50 0.21/0.50 # Proof found! 0.21/0.50 # SZS status Theorem 0.21/0.50 # SZS output start CNFRefutation 0.21/0.50 thf(decl_22, type, cHALF: $i > $i > $o). 0.21/0.50 thf(decl_23, type, cDOUBLE: $i > $i > $o). 0.21/0.50 thf(decl_24, type, cS: $i > $i). 0.21/0.50 thf(decl_25, type, c0: $i). 0.21/0.50 thf(decl_26, type, esk1_3: ($i > $i > $o) > $i > $i > $i). 0.21/0.50 thf(decl_27, type, esk2_3: ($i > $i > $o) > $i > $i > $i). 0.21/0.50 thf(decl_28, type, esk3_0: $i). 0.21/0.50 thf(decl_29, type, esk4_0: $i). 0.21/0.50 thf(cTHM301, conjecture, (![X1:$i, X2:$i]:(((cHALF @ X2 @ X1)<=(cDOUBLE @ X1 @ X2)))<=((((cHALF @ (cS @ c0) @ c0)&![X3:$i, X4:$i]:(((cHALF @ X3 @ X4)=>(cHALF @ (cS @ (cS @ X3)) @ (cS @ X4)))))&(cHALF @ c0 @ c0))&![X5:$i > $i > $o, X1:$i, X2:$i]:(((X5 @ X1 @ X2)<=(((cDOUBLE @ X1 @ X2)&(X5 @ c0 @ c0))&![X3:$i, X4:$i]:(((X5 @ X3 @ X4)=>(X5 @ (cS @ X3) @ (cS @ (cS @ X4)))))))))), file('/export/starexec/sandbox/tmp/tmp.6sEbAUIO3E/E---3.1_28763.p', cTHM301)). 0.21/0.50 thf(c_0_1, negated_conjecture, ~((((((cHALF @ (cS @ c0) @ c0)&![X3:$i, X4:$i]:(((cHALF @ X3 @ X4)=>(cHALF @ (cS @ (cS @ X3)) @ (cS @ X4)))))&(cHALF @ c0 @ c0))&![X5:$i > $i > $o, X1:$i, X2:$i]:(((((cDOUBLE @ X1 @ X2)&(X5 @ c0 @ c0))&![X3:$i, X4:$i]:(((X5 @ X3 @ X4)=>(X5 @ (cS @ X3) @ (cS @ (cS @ X4))))))=>(X5 @ X1 @ X2))))=>![X1:$i, X2:$i]:(((cDOUBLE @ X1 @ X2)=>(cHALF @ X2 @ X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM301])])). 0.21/0.50 thf(c_0_2, negated_conjecture, ![X15:$i, X16:$i, X17:$i > $i > $o, X18:$i, X19:$i]:((((((cHALF @ (cS @ c0) @ c0)&(~(cHALF @ X15 @ X16)|(cHALF @ (cS @ (cS @ X15)) @ (cS @ X16))))&(cHALF @ c0 @ c0))&(((X17 @ (esk1_3 @ X17 @ X18 @ X19) @ (esk2_3 @ X17 @ X18 @ X19))|(~(cDOUBLE @ X18 @ X19)|~(X17 @ c0 @ c0))|(X17 @ X18 @ X19))&(~(X17 @ (cS @ (esk1_3 @ X17 @ X18 @ X19)) @ (cS @ (cS @ (esk2_3 @ X17 @ X18 @ X19))))|(~(cDOUBLE @ X18 @ X19)|~(X17 @ c0 @ c0))|(X17 @ X18 @ X19))))&((cDOUBLE @ esk3_0 @ esk4_0)&~(cHALF @ esk4_0 @ esk3_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.21/0.50 thf(c_0_3, negated_conjecture, ![X1:$i, X2:$i, X5:$i > $i > $o]:(((X5 @ X1 @ X2)|~((X5 @ (cS @ (esk1_3 @ X5 @ X1 @ X2)) @ (cS @ (cS @ (esk2_3 @ X5 @ X1 @ X2)))))|~((cDOUBLE @ X1 @ X2))|~((X5 @ c0 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_4, negated_conjecture, (cDOUBLE @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_5, negated_conjecture, ![X1:$i, X2:$i, X5:$i > $i > $o]:(((X5 @ (esk1_3 @ X5 @ X1 @ X2) @ (esk2_3 @ X5 @ X1 @ X2))|(X5 @ X1 @ X2)|~((cDOUBLE @ X1 @ X2))|~((X5 @ c0 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_6, negated_conjecture, ![X5:$i > $i > $o]:(((X5 @ esk3_0 @ esk4_0)|~((X5 @ (cS @ (esk1_3 @ X5 @ esk3_0 @ esk4_0)) @ (cS @ (cS @ (esk2_3 @ X5 @ esk3_0 @ esk4_0)))))|~((X5 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.21/0.50 thf(c_0_7, negated_conjecture, ![X1:$i, X2:$i]:(((cHALF @ (cS @ (cS @ X1)) @ (cS @ X2))|~((cHALF @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_8, negated_conjecture, (cHALF @ c0 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_9, negated_conjecture, ~((cHALF @ esk4_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_10, negated_conjecture, ![X5:$i > $i > $o]:(((X5 @ (esk1_3 @ X5 @ esk3_0 @ esk4_0) @ (esk2_3 @ X5 @ esk3_0 @ esk4_0))|(X5 @ esk3_0 @ esk4_0)|~((X5 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_5, c_0_4])). 0.21/0.50 thf(c_0_11, negated_conjecture, ~((cHALF @ (esk2_3 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0) @ (esk1_3 @ (^[Z0/* 19 */:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), c_0_9])). 0.21/0.50 thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_11]), c_0_9]), ['proof']). 0.21/0.50 # SZS output end CNFRefutation 0.21/0.50 # Parsed axioms : 5 0.21/0.50 # Removed by relevancy pruning/SinE : 4 0.21/0.50 # Initial clauses : 7 0.21/0.50 # Removed in clause preprocessing : 0 0.21/0.50 # Initial clauses in saturation : 7 0.21/0.50 # Processed clauses : 18 0.21/0.50 # ...of these trivial : 0 0.21/0.50 # ...subsumed : 0 0.21/0.50 # ...remaining for further processing : 18 0.21/0.50 # Other redundant clauses eliminated : 0 0.21/0.50 # Clauses deleted for lack of memory : 0 0.21/0.50 # Backward-subsumed : 0 0.21/0.50 # Backward-rewritten : 0 0.21/0.50 # Generated clauses : 16 0.21/0.50 # ...of the previous two non-redundant : 7 0.21/0.50 # ...aggressively subsumed : 0 0.21/0.50 # Contextual simplify-reflections : 0 0.21/0.50 # Paramodulations : 8 0.21/0.50 # Factorizations : 0 0.21/0.50 # NegExts : 0 0.21/0.50 # Equation resolutions : 2 0.21/0.50 # Disequality decompositions : 0 0.21/0.50 # Total rewrite steps : 2 0.21/0.50 # ...of those cached : 1 0.21/0.50 # Propositional unsat checks : 0 0.21/0.50 # Propositional check models : 0 0.21/0.50 # Propositional check unsatisfiable : 0 0.21/0.50 # Propositional clauses : 0 0.21/0.50 # Propositional clauses after purity: 0 0.21/0.50 # Propositional unsat core size : 0 0.21/0.50 # Propositional preprocessing time : 0.000 0.21/0.50 # Propositional encoding time : 0.000 0.21/0.50 # Propositional solver time : 0.000 0.21/0.50 # Success case prop preproc time : 0.000 0.21/0.50 # Success case prop encoding time : 0.000 0.21/0.50 # Success case prop solver time : 0.000 0.21/0.50 # Current number of processed clauses : 11 0.21/0.50 # Positive orientable unit clauses : 3 0.21/0.50 # Positive unorientable unit clauses: 0 0.21/0.50 # Negative unit clauses : 2 0.21/0.50 # Non-unit-clauses : 6 0.21/0.50 # Current number of unprocessed clauses: 2 0.21/0.50 # ...number of literals in the above : 8 0.21/0.50 # Current number of archived formulas : 0 0.21/0.50 # Current number of archived clauses : 7 0.21/0.50 # Clause-clause subsumption calls (NU) : 1 0.21/0.50 # Rec. Clause-clause subsumption calls : 1 0.21/0.50 # Non-unit clause-clause subsumptions : 0 0.21/0.50 # Unit Clause-clause subsumption calls : 0 0.21/0.50 # Rewrite failures with RHS unbound : 0 0.21/0.50 # BW rewrite match attempts : 0 0.21/0.50 # BW rewrite match successes : 0 0.21/0.50 # Condensation attempts : 0 0.21/0.50 # Condensation successes : 0 0.21/0.50 # Termbank termtop insertions : 2531 0.21/0.50 # Search garbage collected termcells : 284 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.005 s 0.21/0.50 # System time : 0.002 s 0.21/0.50 # Total time : 0.007 s 0.21/0.50 # Maximum resident set size: 1736 pages 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.006 s 0.21/0.50 # System time : 0.005 s 0.21/0.50 # Total time : 0.011 s 0.21/0.50 # Maximum resident set size: 1712 pages 0.21/0.50 % E---3.1 exiting 0.21/0.50 % E exiting 0.21/0.50 EOF